On MARS's s-boxes Strength against Linear Cryptanalysis

نویسندگان

  • Carlos Javier Hernández-Castro
  • L. Javier García-Villalba
  • Julio César Hernández Castro
  • José María Sierra
چکیده

MARS’s s-boxes were generated using a new algorithm developed by the IBM team, which was supposedly able of producing secure s-boxes against both differential and linear cryptanalysis. In this paper we show this is not the case, because their strength against linear cryptanalysis is not better (in fact, it seems to be worse) that what could be expected if generated randomly.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AES-like ciphers: are special S-boxes better then random ones? (Virtual isomorphisms again)

In [eprint.iacr.org/2012/663] method of virtual isomorphisms of ciphers was applied for differential/linear cryptanalysis of AES. It was shown that AES seems to be weak against those attacks. That result can be generalized to AES-like ciphers, which diffusion map is a block matrix, and its block size is the same as the S-box size. S-box is possibly weak if it is affine equivalent to a substitut...

متن کامل

Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis

In this letter, we study the marginal density of the XOR distribution table, and the linear approximation table entries of regular substitution boxes (s-boxes). Based on this, we show that the fraction of good s-boxes (with regard to immunity against linear and differential cryptanalysis) increases dramatically with the number of input variables. Introduction Differential cryptanalysis [1], and...

متن کامل

Security on Generalized Feistel Scheme with SP Round Function

This paper studies the security against differential/linear cryptanalysis and the pseudorandomness for a class of generalized Feistel scheme with SP round function called GFSP . We consider the minimum number of active s-boxes in some consecutive rounds of GFSP ,i.e., in four, eight and sixteen consecutive rounds, which provide the upper bound of the maximum differential/linear probabilities of...

متن کامل

On the Number Of Nonlinear Regular S-boxes

A. M. Youssef and S. E. Tavares Department Of Electrical and Computer Engineering Queen’s University Kingston, Ontario, Canada, K7L 3N6 Phone : (613) 545–2945 Fax : (613) 545–6615 email : [email protected] Indexing terms: Cryptography, Private-key cryptosystems, Substitution boxes, Combinatorics. Abstract Nonlinearity is a crucial requirement for the substitution boxes in secure block ciphe...

متن کامل

Key-Dependent S-Box Generation in AES Block Cipher System

Advanced Encryption Standard (AES) block cipher system is widely used in cryptographic applications. A nonlinear substitution operation is the main factor of the AES cipher system strength. The purpose of the proposed approach is to generate the random S-boxes changing for every change of the secret key. The fact that the S-boxes are randomly key-dependent and unknown is the main strength of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003